General purpose integer factoring
نویسنده
چکیده
This chapter describes the developments since 1970 in general purpose integer factoring and highlights the contributions of Peter L. Montgomery. This article appeared as Chapter 5 of the book Topics in Computational Number Theory inspired by Peter L. Montgomery, edited by Joppe W. Bos and Arjen K. Lenstra and published by Cambridge University Press. See www. cambridge.org/9781107109353. There are cross-references to two chapters of the same book: Chapter 6 Polynomial selection for the number field sieve by Thorsten Kleinjung and Chapter 7 The block Lanczos algorithm by Emmanuel Thomé.
منابع مشابه
On the Factorization of RSA-120
We present data concerning the factorization of the 12O-digit number RSA-120, which we factored on July 9,1993, using the quadratic sieve method. The factorization took approximately 825 MIPS years and was completed within three months real time. At the time of writing RSA-120 is the largest integer ever factored by a general purpose factoring algorithm. We also present some conservative extrap...
متن کاملInteger Factoring Utilizing PC Cluster
The integer factoring problem is one of the oldest and important problems and it is considered as hard, i.e., the problem cannot be solved in polynomial time for the worst case, because the security of RSA is heavily dependent on the difficulties of integer factoring. As is well known, hardware technology is progressing rapidly from year to year and it seems that the time is now ripe to factor ...
متن کاملFactoring Small Integers: An Experimental Comparison
In this data-based paper we report on our experiments in factoring integers from 50 to 200 bits with the postsieving phase of NFS as a potential application. We implemented and compared several general-purpose factoring algorithms suited for these smaller numbers, from Shanks’s square form factorization method to the self-initializing quadratic sieve, and revisited the older continued fraction ...
متن کاملImmunoOptiDrone - A case study on the general suitability of purpose of abstract evolutionary approaches
The work investigates the general suitability of purpose of abstract evolutionary approaches by investigating the issues involved with re-factoring an existing, gene expression programming based, drone control system into an immunologically based general purpose optimization system. The re-purposed model is investigated regarding its suitability suitable for use in clonal expansion based optimi...
متن کاملGNFS Factoring Statistics of RSA-100, 110, ..., 150
GNFS (general number field sieve) algorithm is currently the fastest known algorithm for factoring large integers. Up to the present, several running time estimates for GNFS are announced (ex. [LV00]). These estimates are usually based on the previous factoring results. However, since the previous factoring results were done by various programs and/or computers, it is difficult to compare those...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IACR Cryptology ePrint Archive
دوره 2017 شماره
صفحات -
تاریخ انتشار 2017